Constraint Logic Programming for Local and Symbolic Model-Checking
نویسندگان
چکیده
We propose a model checking scheme for a semantically complete fragment of CTL by combining techniques from constraint logic programming, a restricted form of constructive negation and tabled resolution. Our approach is symbolic in that it encodes and manipulates sets of states using constraints; it supports local model checking using goal-directed computation enhanced by tabulation. The framework is parameterized by the constraint domain and supports any finite constraint domain closed under disjunction, projection and complementation. We show how to encode our fragment of CTL in constraint logic programming; we outline an abstract execution model for the resulting type of programs and provide a preliminary evaluation of the approach.
منابع مشابه
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Bisimulation is a fundamental notion that characterizes behavioral equivalence of concurrent systems. In this paper, we study the problem of encoding eÆcient bisimulation checkers for niteas well as in nite-state systems as logic programs. We begin with a straightforward and short (less than 10 lines) encoding of nite-state bisimulation checker as a tabled logic program. In a goal-directed syst...
متن کاملApplications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops
All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...
متن کاملAutomatic software model checking via constraint logic
This paper proposes the use of constraint logic to perform model checking of imperative, infinite-state programs. We present a semantics-preserving translation from an imperative language with recursive procedures and heap-allocated mutable data structures into constraint logic. The constraint logic formulation provides a clean way to reason about the behavior and correctness of the original pr...
متن کاملAutomatic Software Model Checking Using CLP
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from an imperative language with heap-allocated mutable data structures and recursive procedures into CLP. The CLP formulation (1) provides a clean way to reason about the behavior and correctness of the original program, ...
متن کاملSymbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization
A b s t r a c t . In this paper, we present the constraint language Toupie which is a finite domain /z-calculus interpreter that uses extended decision diagrams to represent relations and formulae. "Classical" constraint logic programming languages over finite domains (CLP(~':D)) are designed to find one solution to a constraint problem, eventually the best one according to a given criterion. I...
متن کامل